package leetcode;

import java.util.ArrayList;
import java.util.Properties;

public class test4 {

    public static void main(String[] args) {
        int a =1 ;
        int b = 1;
        int c = 0;
        for(int i = 3 ;i<=11;i++){
            c = a+b;
            a=b;
            b=c;
            System.out.println(c);
        }
    }

    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int low1 = 0, high1 = nums1.length - 1;
        int low2 = 0, high2 = nums2.length - 1;

        while (low1 < high1 && low2 < high2) {

        }
        return 1 ;
    }
}
